Gaussian Covariance Faithful Markov Trees
نویسندگان
چکیده
1 Unité de Recherche Signaux et Systémes (U2S), Ecole Supérieure de la Statistique et de l’Analyse de l’Information (ESSAI), Ecole Nationale d’Ingénieurs de Tunis (ENIT), 6 Rue des Métiers, Charguia II 2035, Tunis Carthage, Ariana, Tunis 1002, Tunisia 2 Department of Statistics, Department of Environmental Earth System Science, Woods Institute for the Environment, Stanford University, Standford, CA 94305, USA
منابع مشابه
Gaussian Faithful Markov Trees
We study two types of graphical models in this paper: concentration and covariance graphical models. Graphical models use graphs to encode or capture the multivariate dependencies that are present in a given multivariate distribution. A concentration graph associated with a multivariate probability distribution of a given random vector is an undirected graph where each vertex represents each of...
متن کاملHigh-dimensional covariance decomposition into sparse Markov and independence models
Fitting high-dimensional data involves a delicate tradeoff between faithful representation and the use of sparse models. Too often, sparsity assumptions on the fitted model are too restrictive to provide a faithful representation of the observed data. In this paper, we present a novel framework incorporating sparsity in different domains. We decompose the observed covariance matrix into a spars...
متن کاملDynamicallx Configurable Acoustic Models for Speech Recognition
Senones were introduced to share Hidden Markov model (HMM) parameters at a sub-phonetic level in [3] and decision trees were incorporated to predict unseen phonetic contexts in [4]. In this paper, we will describe two applications of the senonic decision tree in (1) dynamically downsizing a speech recognition system for small platforms and in (2) sharing the Gaussian covariances of continuous d...
متن کاملEstimation of GMRF's by Recursive Cavity Modeling
This thesis develops the novel method of recursive cavity modeling as a tractable approach to approximate inference in large Gauss-Markov random fields. The main idea is to recursively dissect the field, constructing a cavity model for each subfield at each level of dissection. The cavity model provides a compact yet (nearly) faithful model for the surface of one subfield sufficient for inferri...
متن کاملDynamically configurable acoustic models for speech recognition
Senones were introduced to share Hidden Markov model (HMM) parameters at a sub-phonetic level in [3] and decision trees were incorporated to predict unseen phonetic contexts in [4]. In this paper, we will describe two applications of the senonic decision tree in (1) dynamically downsizing a speech recognition system for small platforms and in (2) sharing the Gaussian covariances of continuous d...
متن کامل